搜索资源列表
shortest-route
- 用的vc++6.0，做的一个最短路径查询的小程序，用的Floyd算法，自己初始化的校地图。-A shortest path query applet, using Floyd algorithm, their initialization of the school map.
shortest-path
- 设计一个交通咨询系统，能让旅客咨询从任一个城市顶点到另一个城市顶点之间的最短路径（里程）或最低花费或最短时间等问题。对于不同咨询要求，可输入城市间的路程或所需时间或所需费用。-Design a traffic advisory system, can let passengers from a city of consulting the vertices to another city between vertices of the shortest path (mileage) or the
the-shortest-path-of-chart
- 求有向图的最短路劲，根据所给图的边长和顶点，建立有向图，以邻接表的方式存储，并编写程序求从有向图任一点出发的最短路径-according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart
Shortest-Path
- 此程序使用C语言编写，描述的是最短路径问题的一种解决方案，仅作参考。-This program uses the C language descr iption is a solution of the shortest path problem, for reference only.
shortest-path
- 这个代码最要是实现最短路径问题，最短路径问题是图论中的一个很重要问题-This code the most if the shortest path problem, shortest path problem is a very important problem in graph theory
Shortest-Path
- Netlogo a simulation language. in this particular case the nodes are set on grid and are moving by chosing the shortest path
shortest-path
- 该程序基于Floyd算法实现最短路径寻优，这里仅是在小规模节点数情况下进行演示。最短路径用红线标出，点击最短路径上某个节点(即该节点出现故障)，程序会自动更新最短路径。-The program is based on Floyd shortest path algorithm optimization, where only a small number of nodes in a presentation case. Shortest path marked with red, click o
shortest-path
- dijkstra计算最短路径，算法在优化、图像处理、网格处理等相关领域有非常广泛的应用，希望能借此机会了解其实质内容，并灵活应用其到所学领域中。-dijkstra calculate the shortest path algorithm optimization, image processing, mesh processing and other related fields have a very wide range of applications, hoping to take th
path
- 求迷宫的最短路径,设计一个算法找一条从迷宫入口到出口的最短路径。-Find the shortest path maze design an algorithm to find a shortest path from the entrance to the maze exit.
Binary-tree-shortest-path-summation
- 这是一个数据结构中二叉树的最短路径求解的问题的源代码打包，代码简明易懂，方便初学者的学习-This is a binary tree data structure for solving the shortest path problem' s source code package, code easy to understand, easy for beginners to learn
A
- 在C++下进行地图的最短路径搜索的A*算法这个算法被广泛应用在即时游戏的路径寻找过程上。-In the C++ under the map of the A* shortest path search algorithm for this algorithm is widely used in real-time search process on the path of the game.
Shortest-Path
- 在网络通信中，经常需要求最短路径。但完全采用最短路径传输有这样一个问题：如果最终在两个终端节点之间给出的最短路径只有一条，则在该路径中的任一个节点或链路出现故障时，信号传输将面临中断的危险。因此，对网络路由选择作了以下改进：为任意两节点之间通信提供两条路径供其选择，即第一最短路径、第二最短路径.使用数据结构编程实现，程序=算法+数据结构的很好体现-In network communication, often request the shortest path. But totally shor
shortest-path
- 最短路径算法，通过本程序，能够清晰的明白算法的原理，并且程序能够很清楚的描述算法，对于想了解算法的人，也是非常不错的选择-Shortest path algorithm, through this program, can clearly understand algorithm principle, and the program can be very clear descr iption of the algorithm, for people who want to know the a
Maze-shortest-path
- 迷宫最短路径 有关迷宫的一个小程序，绘制迷宫图，找到最短路径。-Maze of the shortest path of the maze of a small program, draw a maze, find the shortest path.
Shortest-path-routing-algorithm
- 最短路径路由算法——节点标记为A,B,C,D,E,结果可得到从A出发到其他节点的最短路径-Shortest path routing algorithm
shortest-path
- 这是用MFC写的，开发环境是VC++。 它能完成最短路径求解，并以列表的形式显示从起点到各点的最短路径，同时能以图形显示出待求解的路径图。画图部分使用的是MFC的GDI绘图。-It`s a MFC project and yhe development environment is VC++.It sloves the problem of shortest path.It shows the shortest path the source point to the other poin
hopbyhop-shortest-path
- Dijkstra thought about the shortest path problem when working at the Mathematical Center in Amsterdam in 1956 as a programmer to demonstrate capabilities of a new computer called ARMAC. His objective was to choose both a problem as well as an answer
based on spfa, the sum of the shortest path
- 一个简单的SPFA计数问题，用pascal语言写的(just a simple code . calculate the sum of the shortest path based on the algorithm of SPFA)
ArcGIS——Shortest path
- ArcGIS二次开发最短路径，基于VS的ArcGIS二次开发，实现地图查找两点之间最短路径功能(The shortest path in the secondary development of ArcGIS and the second development of ArcGIS based on VS realize the function of searching the shortest path between two points in a map.)
A星寻路
- 通过指定的栅格地图，运用A星算法得出最短路径(Through the specified grid map, the shortest path is obtained by a star algorithm)